井喷失控预警的远距离自动调焦控制研究

井喷失控是石油及天然气钻井、完井过程可能出现的灾难性事故，给人类生命财产造成严重伤害，污染环境，破坏地下资源以及在城市火灾、森林火灾、环境变化等监测工作中常需要远距离目标监测，为了获得高清晰的实时图像数据，需要实时自动调焦。通过系统分析远距离相机离焦的原因，建立了一个实时调焦数学模型，并以此为基础研制了一种新的对应距离和温度变化的离焦补偿控制系统。该系统采用微型步进电机实现智能控制，通过监测目标距离确定监测相机的初始焦距，以及环境温度变化的实时反馈实现焦距的实时控制，使相机可以在－40～125 ℃范围内获得清晰、稳定的远距离图像。该系统适用于井喷失控石油及天然气火灾、城市火灾、森林火灾、环境变化等远距离目标的实时监测。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

基于遗传算法的服装工序编排规划

本文讨论了建立服装工序编排系统的必要性，在进行服装工序拆分、合并的基础上，应用遗传算法建立了以流水线平衡为目标的服装工序编排模型．     

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez     

一种有效的并行汉字／字符串相似检索技术

本文提出了一种有效的并行汉字／字符串相似检索技术．通过引入搜索状态向量及字符一模式匹配向量，该技术将字符串匹配比较转化为简单的整数字位运算，通过对字符串方向相反的搜索有效地实现了多处理机对汉字／字符串的并行相似检索．文中也给出了并行实现算法，同时分析了算法的复杂性．     

一种实时心电图数据压缩算法

提出了一种实时心电图ＥＣＧ数据压缩算法。它是将自适应变门限算法与转折点算法相结合。自适应变门限算法是对ＡＺＴＥＣ算法的改进．它计算ＥＣＧ信号的几个统计参数来确定可变门限值。转折点算法是分析采样点的趋势并只存储每对连续的采样点中的一个。它保留信号的斜坡标志发生变化的峰点和谷点。本文算法兼有这两种算法的优点。这种算法在较高压缩比的情况下重建心电图信号失真较小．     

心电地图仪中工频干扰的一种滤除方法

在心电地图仪中记录到的体表心电信号往往由于电磁的影响而引进工频干扰．基于体表心电信号中工频干扰的特点，作者提出了一种滤除工频干扰的方法，即就单独—胸导联信号通过提高频谱的分辨率来估计工频干扰的频率；基于最小均方误差准则来估计各导联信号中工频干扰的幅度和相位。文中还给出了该算法的流程图和滤波性能分析。模拟结果表明了该算法的有效性。应用该算法对心电地图仪中的工频干扰进行对消，取得了满意的结果。     

BP算法的改进及用模拟电路实现的神经网络分类器

基于用模拟电路实现神经网络分类器的目的，对多层静态前馈神经网络的ＢＰ算法做了改进，采用线性限幅函数代替Ｓｉｇｍｏｉｄ函数作为神经元的激活函数，给出了改进的ＢＰ算法。对该算法性能的实验研究表明：这种改进算法不但方便了用线性模拟集成运算放大电路实现神经网络，而且具有学习速度快，映射能力强等优点。根据本文算法设计的神经网络分类器，无论是计算机仿真，还是模拟电路实现，都得到了比较高的识别率。     

工业过程随机稳态优化控制算法的鲁棒性分析

本文给出了一种随机稳态优化算法的灵敏度分析，讨论算法解对参数变化的关系。这些参数代表系统结构参数或噪声向量的某些数字特征．